یافتن راه‌حل‌های مؤثر در مسائل بهینه‌سازی ترکیبی چندهدفه به کمک روش قیود ارتجاعی

In this paper, a general process is developed to find all non-dominated solutions of the multi objective combinatorial optimization (MOCO) problem. This process is based on the elastic constraints method and applies the identification of objective's bounds for it. Objectives bounds are determined by solving single objective integer programming problems. First the elastic constraints method is performed on a bi-objective problem. Next the process is performed on a tri-objective problem, and finally it is developed on each general multi objective integer programming (MOIP) problem. In this paper, a numerical example such as tri-objective assignment problem is presented to clear the proposed method.